Mixed-integer programming formulation of a data-driven solver in computational elasticity

An evolutionary solver for mixed integer programming

In this paper we introduce an evolutionary algorithm for the solution of mixed integer programs. The strategy is based on the separation of the set of variables into the integer subset and the continuous subset. The main idea is that if the integer variables are fixed by the evolutionary system, the continuous ones can be determined in function of them by a linear program, which simultaneously ...

An Exact Rational Mixed-Integer Programming Solver

We present an exact rational solver for mixed-integer linear programming which avoids the numerical inaccuracies inherent in the floating-point computations adopted in existing software. This allows the solver to be used for establishing fundamental theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbol...

The Mixed Integer Linear Programming Solver

Separation of Mixing Inequalities in a Mixed Integer Programming Solver

This paper shows how valid inequalities based on the mixing set can be used in a mixed integer programming (MIP) solver. It discusses the relation of mixing inequalities to flow path and mixed integer rounding inequalities and how currently used separation algorithms already generate cuts implicitly that can be seen as mixing cuts. Further on, it describes two new separation algorithms that gen...

A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...